Fast sampling from a Gaussian Markov random field using Krylov subspace approaches
نویسندگان
چکیده
Many applications in spatial statistics, geostatistics and image analysis require efficient techniques for sampling from large Gaussian Markov random fields (GMRFs). A suite of methods, based on the Cholesky decomposition, for sampling from GMRFs, sampling conditioned on a set of linear constraints, and computing the likelihood were presented by Rue (2001). In this paper, we present an alternate set of methods based on Krylov subspace approaches. These methods have the advantage of requiring far less storage than the Cholesky decomposition and may be useful in problems where computing a Cholesky decomposition is infeasible.
منابع مشابه
Fast Bayesian Analysis of Spatial Dynamic Factor Models for Large Space Time Data Sets
Remoting sensing is one example where data sets that vary across space and time have become so large that ‘standard’ approaches employed by statistical modellers for applied analysis are no longer feasible. In this paper, we present a Bayesian methodology, which makes use of recently developed algorithms in applied mathematics, for the analysis of large space time data sets. In particular, a Ma...
متن کاملSolving Stochastic PDEs with Approximate Gaussian Markov Random Fields using Different Programming Environments
This thesis is a study on the implementation of the Gaussian Markov Random Field (GMRF) for random sample generation and also the Multilevel Monte Carlo (MLMC) method to reduce the computational costs involved with doing uncertainty quantification studies. The GMRF method is implemented in different programming environments in order to evaluate the potential performance enhancements given varyi...
متن کاملFast Object Class Recognition
We propose a novel approach for object class recognition using scale invariant features and Gaussian Processes as our kernel-based classifier. We measure the performance of this approach in two stages: predicting the presence of a class of objects in images and localizing them. Our object class recognition method is comparable to other state-of-the-art approaches. Furthermore, we propose sophis...
متن کاملEfficient Iterative Solvers for Stochastic Galerkin Discretizations of Log-Transformed Random Diffusion Problems
We consider the numerical solution of a steady-state diffusion problem where the diffusion coefficient is the exponent of a random field. The standard stochastic Galerkin formulation of this problem is computationally demanding because of the nonlinear structure of the uncertain component of it. We consider a reformulated version of this problem as a stochastic convection-diffusion problem with...
متن کاملPreconditioned Krylov Subspace Methods for Sampling Multivariate Gaussian Distributions
A common problem in statistics is to compute sample vectors from a multivariate Gaussian distribution with zero mean and a given covariance matrix A. A canonical approach to the problem is to compute vectors of the form y = Sz, where S is the Cholesky factor or square root of A, and z is a standard normal vector. When A is large, such an approach becomes computationally expensive. This paper co...
متن کامل